Request-based gossiping without deadlocks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Request-Based Gossiping without Deadlocks

By the distributed averaging problem is meant the problem of computing the average value of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each iter...

متن کامل

Deadlocks in Distributed Systems: Request Models and Definitions

This paper deals with the problem of deadlock detection in asynchronous messages communication systems. The considered system model covers unspecified receptions, not FIFO channels, and general resource (message) requests including, among others, AND, OR,

متن کامل

Coupling timed plant and controller models without introducing deadlocks

This paper focuses on timed models which represent closed-loop systems composed of a plant and a logic controller. Both plant and controller models are described in a formalism where urgent transitions are possible, to avoid non-realistic evolutions, and without deadlock when they are separated. It is first shown that deadlocks may occur in the plant model once the two models are coupled. To so...

متن کامل

Request - Based Mediated Execution

data structures are useful in any system, as a means of separating interfaces from implementations. Normally, data structures are considered as concrete within the scope of an implementation module, and abstract everywhere else that they are visible in the program. Thus an abstract data structure has global extent, although its internals are only visible within a specific scope. But when a prog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2018

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2018.03.001